Combining Optimisation and Simulation Using Logic Based Benders Decomposition

نویسندگان

چکیده

Operations Research practitioners often want to model complicated functions that are difficult encode in their underlying optimisation framework. A common approach is solve an approximate model, and then use a simulation evaluate the true objective value of one or more solutions. We propose new integrating into itself. The idea run at each incumbent solution master problem. results used guide trajectory itself using logic-based Benders cuts. test on class stochastic resource allocation problems with monotonic performance measures. derive strong novel cuts provably valid for all given form. consider two concrete examples: nursing home shift scheduling problem, airport check counter While previous papers these applications could only approximately realistic instances, we able them exactly within reasonable amount time. Moreover, while those account inherent variance problem by including estimates random variables as parameters, compute sample-average approximations optimality up 100 scenarios.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logic-Based Benders Decomposition

Benders decomposition uses a strategy of “learning from one’s mistakes.” The aim of this paper is to extend this strategy to a much larger class of problems. The key is to generalize the linear programming dual used in the classical method to an “inference dual.” Solution of the inference dual takes the form of a logical deduction that yields Benders cuts. The dual is therefore very different f...

متن کامل

Robust Scheduling with Logic-Based Benders Decomposition

We study project scheduling at a large IT services delivery center in which there are unpredictable delays. We apply robust optimization to minimize tardiness while informing the customer of a reasonable worst-case completion time, based on empirically determined uncertainty sets. We introduce a new solution method based on logic-based Benders decomposition. We show that when the uncertainty se...

متن کامل

Planning and Scheduling by Logic-Based Benders Decomposition

We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. Tasks assigned to a facility may run in parallel subject to resource constraints (cumulative scheduling). We solve pro...

متن کامل

Single-facility scheduling by logic-based Benders decomposition

Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either method alone. We find that a similar technique can be beneficial for solving pure scheduling problems as the problem size scales up. We solve single-facility non-preemptive scheduling problems with time windows and long time horizon...

متن کامل

Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition

We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capacity constraints, and the allocation of the customers to trucks at those facilities under per truck traveldistance constraints. We present a hybrid approach that combines integer programming and constraint programming using logic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2023

ISSN: ['1872-6860', '0377-2217']

DOI: https://doi.org/10.1016/j.ejor.2023.07.032